High - Dimensional Problems : Multivariate Linear Tensor Product Problems , Multivariate Numerical Integration , and Geometric Discrepancy
نویسنده
چکیده
The articles are listed in the order of their appearance in the appendix. In the summary the mathematical background of the problems treated in this thesis is described, and the research articles are discussed in detail. of New South Wales in Sydney. I would like to thank the colleagues in these places for their hospitality. Furthermore, I would like to acknowledge support from the DFG under the grants SR7/10-1, GN91/1-1, GN91/2-1, and GN91/3-1. Last, but not least I would like to thank my collaborators for many inspiring discussions and for the work they contributed to the articles collected in this thesis.
منابع مشابه
Explicit Cost Bounds of Algorithms for Multivariate Tensor Product Problems
We study multivariate tensor product problems in the worst case and average case settings. They are deened on functions of d variables. For arbitrary d, we provide explicit upper bounds on the costs of algorithms which compute an "-approximation to the solution. The cost bounds are of the form (c(d) + 2) 1 2 + 3 ln 1=" d ? 1 4 (d?1) 1 " 5 : Here c(d) is the cost of one function evaluation (or o...
متن کاملExplicit Cost Bounds of Algorithms
We study multivariate tensor product problems in the worst case and average case settings. They are deened on functions of d variables. For arbitrary d, we provide explicit upper bounds on the costs of algorithms which compute an "-approximation to the solution. The cost bounds are of the form (c(d) + 2) 1 2 + 3 ln 1=" d ? 1 4 (d?1) 1 " 5 : Here c(d) is the cost of one function evaluation (or o...
متن کاملSpecial Session 53: Greedy Algorithms and Tensor Product Representations for High-Dimensional Problems
The curse of dimensionality remains a major obstacle to numerical simulations in various fields such as quantum chemistry, molecular dynamics or uncertainty quantification for instance. Tensor product representations of multivariate functions are a promising way to avoid this di culty. Besides, greedy algorithms have been used in many contexts in order to provide satisfactory, but not usually o...
متن کاملQuasi-polynomial tractability
Tractability of multivariate problems has become nowadays a popular research subject. Polynomial tractability means that the solution of a d-variate problem can be solved to within ε with polynomial cost in ε−1 and d. Unfortunately, many multivariate problems are not polynomially tractable. This holds for all non-trivial unweighted linear tensor product problems. By an unweighted problem we mea...
متن کاملGeneralized Tractability for Multivariate Problems Part II: Linear Tensor Product Problems, Linear Information, and Unrestricted Tractability
We continue the study of generalized tractability initiated in our previous paper “Generalized tractability for multivariate problems, Part I: Linear tensor product problems and linear information”, J. Complexity, 23, 262-295 (2007). We study linear tensor product problems for which we can compute linear information which is given by arbitrary continuous linear functionals. We want to approxima...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009